Stochastic Local Search for Bayesian Networks
نویسندگان
چکیده
The paper evaluates empirically the suitability of Stochastic Local Search algorithms (SLS) for nding most probable explanations in Bayesian networks. SLS algorithms (e.g., GSAT, WSAT [16]) have recently proven to be highly e ective in solving complex constraint-satisfaction and satis ability problems which cannot be solved by traditional search schemes. Our experiments investigate the applicability of this scheme to probabilistic optimization problems. Speci cally, we show that algorithms combining hill-climbing steps with stochastic steps (guided by the network's probability distribution) called G+StS, outperform pure hill-climbing search, pure stochastic simulation search, as well as simulated annealing. In addition, variants of G+StS that are augmented on top of alternative approximation methods are shown to be particularly e ective.
منابع مشابه
Learning Bayesian Networks from Incomplete Data with Stochastic Search Algorithms
This paper describes stochastic search approaches, including a new stochastic algorithm and an adaptive mutation operator, for learning Bayesian networks from incomplete data. This problem is characterized by a huge solution space with a highly multimodal landscape. State-of-the-art approaches all involve using deterministic approaches such as the expectation-maximization algorithm. These appro...
متن کاملEfficient Stochastic Local Search for MPE Solving
Finding most probable explanations (MPEs) in graphical models, such as Bayesian belief networks, is a fundamental problem in reasoning under uncertainty, and much effort has been spent on developing effective algorithms for this NP-hard problem. Stochastic local search (SLS) approaches to MPE solving have previously been explored, but were found to be not competitive with state-of-theart branch...
متن کاملStochastic Local Algorithms for Learning Belief Networks: Searching in the Space of the Orderings
An important type of methods for learning belief networks from data are those based on the use of a scoring metric, to evaluate the fitness of any given candidate network to the data base, and a search procedure to explore the set of candidate networks. In this paper we propose a new method that carries out the search not in the space of directed acyclic graphs but in the space of the orderings...
متن کاملStochastic Optimality Theory, local search, and Bayesian learning of hierarchical models
The Gradual Learning Algorithm (GLA) (Boersma and Hayes, 2001) can be seen as a stochastic local search method for learning Stochastic OT grammars. This paper tries to achieve the following goals: first, in response to the criticism in (Keller and Asudeh, 2002), we point out that the computational problem of learning stochastic grammars does have a general approximate solution (Lin, 2005). Seco...
متن کاملAn iterated local search algorithm for learning Bayesian networks with restarts based on conditional independence tests
A common approach for learning Bayesian networks (BNs) from data is based on the use of a scoring metric to evaluate the fitness of any given candidate network to the data and a method to explore the search space, which usually is the set of directed acyclic graphs (DAGs). The most efficient search methods used in this context are greedy hill climbing, either deterministic or stochastic. One of...
متن کامل